Additive Combinatorics and Theoretical Computer Science ∗ Luca Trevisan
نویسنده
چکیده
Additive combinatorics is the branch of combinatorics where the objects of study are subsets of the integers or of other abelian groups, and one is interested in properties and patterns that can be expressed in terms of linear equations. More generally, arithmetic combinatorics deals with properties and patterns that can be expressed via additions and multiplications. In the past ten years, additive and arithmetic combinatorics have been extremely successful areas of mathematics, featuring a convergence of techniques from graph theory, analysis and ergodic theory. They have helped prove long-standing open questions in additive number theory, and they offer much promise of future progress. Techniques from additive and arithmetic combinatorics have found several applications in computer science too, to property testing, pseudorandomness, PCP constructions, lower bounds, and extractor constructions. Typically, whenever a technique from additive or arithmetic combinatorics becomes understood by computer scientists, it finds some application. Considering that there is still a lot of additive and arithmetic combinatorics that computer scientists do not understand (and, the field being very active, even more will be developed in the near future), there seems to be much potential for future connections and applications.
منابع مشابه
Additive Combinatorics and its Applications in Theoretical Computer Science
Additive combinatorics (or perhaps more accurately, arithmetic combinatorics) is a branch of mathematics which lies at the intersection of combinatorics, number theory, Fourier analysis and ergodic theory. It studies approximate notions of various algebraic structures, such as vector spaces or fields. In recent years, several connections between additive combinatorics and theoretical computer s...
متن کاملProof of the Sum - Product Theorem
These are notes from a mini course on additive combinatorics given in Princeton University on August 23-24, 2007. The lectures were Boaz Barak (Princeton University), Luca Trevisan (University of California at Berkeley) and Avi Wigderson (Institute for Advanced Study, Princeton). The notes were taken by Aditya Bhaskara, Arnab Bhattacharyya, Moritz Hardt, Cathy Lennon, Kevin Matulef, Rajsekar Ma...
متن کاملAn Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem
The polynomial Freiman-Ruzsa conjecture is one of the most important conjectures in additive combinatorics. It asserts that one can switch between combinatorial and algebraic notions of approximate subgroups with only a polynomial loss in the underlying parameters. This conjecture has also found several applications in theoretical computer science. Recently, Tom Sanders proved a weaker version ...
متن کاملSelected Results in Additive Combinatorics: An Exposition (Preliminary Version)
We give a self-contained exposition of selected results in additive combinatorics over the group GF (2)n = {0, 1}n. In particular, we prove the celebrated theorems known as the Balog-Szemeredi-Gowers theorem (’94 and ’98) and the Freiman-Ruzsa theorem (’73 and ’99), leading to the remarkable result by Samorodnitsky (’07) that linear transformations are efficiently testable. No new result is pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009